Remapping time across space.

نویسندگان

  • Nestor Matthews
  • Leslie Welch
  • Elena Festa
  • Andrew Clement
چکیده

Multiple lines of evidence indicate that visual attention's temporal properties differ between the left and right visual fields (LVF and RVF). Notably, recent electroencephalograph recordings indicate that event-related potentials peak earlier for LVF than for RVF targets on bilateral-stream rapid serial visual presentation (RSVP) identification tasks. Might this hastened neural response render LVF targets perceptually available sooner than RVF targets? If so, how might the visual system reconcile these timing differences to estimate simultaneity across the LVF and RVF? We approached these questions by presenting bilateral-stream RSVP displays that contained opposite-hemifield targets and requiring participants to judge both the targets' temporal order and simultaneity. The temporal order judgments (TOJs) revealed that participants perceived LVF targets ∼134 ms sooner than RVF targets. This LVF hastening approximates a full cycle of visual attention's canonical ∼10 Hz (∼100 ms) temporal resolution. In contrast, performance on the simultaneity task did not exhibit the LVF hastening observed on the TOJ task, despite identical retinal stimulation across the two tasks. This finding rules out a stimulus-driven "bottom-up" explanation for the task-specific behavior. Moreover, error patterns across the two tasks revealed that, within the decision stage of simultaneity judgments, participants remapped LVF targets, but not RVF targets, to a later time in the RSVP sequence. Such hemifield-specific remapping would effectively compensate for the cross-hemifield asymmetries in neural response latencies that could otherwise impair simultaneity estimates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remapping Subpartitions of Hyperspace Using Iterative Genetic Search Remapping Subpartitions of Hyperspace Using Iterative Genetic Search Remapping Subpartitions of Hyperspace Using Iterative Genetic Search

Various strategies for remapping hyperspace associated with two iterative genetic algorithms are reviewed, compared and empirically tested on a particular \real-world" problem. Both algorithms reduce the hypercube at each iteration such that each new mapping samples only subpartitions of the search space. Delta coding remaps the search space at each iteration by sampling the subspace numericall...

متن کامل

Pitch-aware Real-time Timbral Remapping

We propose an approach to timbral remapping, a process which maps the timbre variations of one audio source onto the timbre variations of another, for real-time control of synthesis. Puckette [17] has made a foray into such a concept, but there are two important issues which must be addressed: how best to construct the timbre space for remapping purposes; and how to perform this remapping effic...

متن کامل

The contribution of spatial remapping impairments to unilateral visual neglect.

Left visual neglect following right hemisphere damage is a heterogeneous phenomenon, in which several underlying impairments have been identified. Despite recent advances in understanding the neural and cognitive bases of these impairments, current theories of neglect, particularly those that emphasise attentional deficits, do not explain a number of phenomena, including: 'Ipsilesional' neglect...

متن کامل

Perceptual evidence for saccadic updating of color stimuli.

In retinotopically organized areas of the macaque visual cortex, neurons have been found that shift their receptive fields before a saccade to their postsaccadic position. This saccadic remapping has been interpreted as a mechanism contributing to perceptual stability of space across eye movements. So far, there is only limited evidence for similar mechanisms that support perceptual stability o...

متن کامل

Power Optimization of Embedded Memory Systems via Data Remapping

In this paper, we provide a novel compile-time data remapping algorithm that runs in linear time. This remapping algorithm is the first fully automatic approach applicable to pointer-intensive dynamic applications. We show that data remapping can be used to significantly reduce the energy consumed as well as the memory size needed to meet a user-specified performance goal (i.e., execution time)...

متن کامل

Influence of saccade efference copy on the spatiotemporal properties of remapping: a neural network study.

Remapping of gaze-centered target-position signals across saccades has been observed in the superior colliculus and several cortical areas. It is generally assumed that this remapping is driven by saccade-related signals. What is not known is how the different potential forms of this signal (i.e., visual, visuomotor, or motor) might influence this remapping. We trained a three-layer recurrent n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of vision

دوره 13 8  شماره 

صفحات  -

تاریخ انتشار 2013